A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs
نویسندگان
چکیده
We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an imperative programming language for stack machines. The certificate of polynomiality can be built in polytime, with respect to the number of stacks used. 1998 ACM Subject Classification Theory, Verification
منابع مشابه
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
In earlier work of Kristiansen and Niggl the polynomial-time computable functions were characterised by stack programs of μ-measure 0, and the linear-space computable functions by loop programs of μ-measure 0. Until recently, an open problem was how to extend these characterisations to programs with user-friendly basic instructions, such as assignment statements, and with mixed data structures....
متن کاملOn the computational complexity of imperative programming languages
Two restricted imperative programming languages are considered: One is a slight modification of a loop language studied intensively in the literature, the other is a stack programming language over an arbitrary but fixed alphabet, supporting a suitable loop concept over stacks. The paper presents a purely syntactical method for analysing the impact of nesting loops on the running time. This giv...
متن کاملThe Garland Measure and Computational Complexity of Stack Programs
A key problem in implicit computational complexity is to analyse the impact on program run times of nesting restricted control structures, such as for-do statements in imperative languages. This problem has two aspects. One is whether there are methods of extracting information from the syntax of such programs that give insight as to why some nesting of control structures may cause a blow up in...
متن کاملA Higher-Order Characterization of Probabilistic Polynomial Time
We present RSLR, an implicit higher order characterization of the class PP of those problems which can be decided in probabilistic polynomial time with error probability smaller than 1/2. Analogously, we can get a characterization of the class BPP. RSLR is an extension of Hofmann’s SLR with a probabilistic primitive. We prove that this system enjoys subject reduction. Polytime soundness is obta...
متن کاملType-based heap and stack space analysis in Java
A type system is introduced for a strict but expressive subset of Java in order to infer resource upper bounds on both the heap-space and the stack-space requirements of typed programs. This type system is inspired by previous works on Implicit Computational Complexity, using tiering and noninterference techniques. The presented methodology has several advantages. First, it provides explicit po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1304.3249 شماره
صفحات -
تاریخ انتشار 2013